On Extremal Connectivity Properties of Unavoidable Matroids
نویسندگان
چکیده
منابع مشابه
Connectivity Properties of Matroids
The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and two bases are connected by an edge if and only if one can be obtained from the other by the exchange of a single pair of elements. In this paper we prove that a matroid is \connected" if and only if the \restricted bases-exchange graph" (the bases-exchange graph restricted to exchanges involving ...
متن کاملSymmetric Matroids and Connectivity Properties of Graphs
A symmetric matroid is a matroid deened on the edge-set of some countably innnite complete graph K in a way that ranks of nite sub-graphs of K are invariant under isomorphism. Thus a symmetric ma-troid M induces on any nite graph G a uniquely determined matroid M(G). We study connectivity properties of circuits and generalized trees of symmetric matroids. We give several characterizations of a ...
متن کاملUnavoidable parallel minors of regular matroids
We prove that, for each positive integer k, every sufficiently large 3-connected regular matroid has a parallel minor isomorphic to M∗(K3,k), M(Wk), M(Kk), the cycle matroid of the graph obtained from K2,k by adding paths through the vertices of each vertex class, or the cycle matroid of the graph obtained from K3,k by adding a complete graph on the vertex class with three vertices.
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملUnavoidable Connected Matroids Retaining a Specified Minor
A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Pou-Lin Wu showed that we can ensure that M has a big circuit or a big cocircuit containing any chosen element of M . In this paper, we begin with a fixed connected matroid N and we take M to be a connected matroid that has N as a minor. Our main result establishes that ifM is sufficiently large, then, up to dua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1999
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1856